Finding Rumor Sources on Random Trees
نویسندگان
چکیده
منابع مشابه
Finding Rumor Sources on Random Trees
We consider the problem of detecting the source of a rumor which has spread in a network using only observations about which set of nodes are infected with the rumor and with no information as to when these nodes became infected. In a recent work (Shah and Zaman 2010) this rumor source detection problem was introduced and studied. The authors proposed the graph score function rumor centrality a...
متن کاملFinding Rumor Sources on Random Graphs
We consider the problem of detecting the source of a rumor (information diffusion) in a network based on observations about which set of nodes possess the rumor. Finding rumor sources is a very general type of problem which arises in many different contexts. For example, the rumor could be a computer virus on the Internet, a contagious disease in a human population, or a trend in a social netwo...
متن کاملRumor Source Detection for Rumor Spreading on Random Increasing Trees
In a recent paper, Shah and Zaman proposed the rumor center as an effective rumor source estimator for rumor spreading on random graphs. They proved for a very general random tree model that the detection probability remains positive as the number of nodes to which the rumor has spread tends to infinity. Moreover, they derived explicit asymptotic formulas for the detection probability of random...
متن کاملRumor Source Obfuscation on Irregular Trees
Anonymous messaging applications have recently gained popularity as a means for sharing opinions without fear of judgment or repercussion. These messages propagate anonymously over a network, typically defined by social connections or physical proximity. However, recent advances in rumor source detection show that the source of such an anonymous message can be inferred by certain statistical in...
متن کاملFinding Adam in random growing trees
We investigate algorithms to find the first vertex in large trees generated by either the uniform attachment or preferential attachment model. We require the algorithm to output a set of K vertices, such that, with probability at least 1 − ε, the first vertex is in this set. We show that for any ε, there exist such algorithms with K independent of the size of the input tree. Moreover, we provid...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research
سال: 2016
ISSN: 0030-364X,1526-5463
DOI: 10.1287/opre.2015.1455